Implicational Relevance Logic is 2-ExpTime-Complete
نویسنده
چکیده
We show that provability in the implicational fragment of relevance logic is complete for doubly exponential time, using reductions to and from coverability in branching vector addition systems.
منابع مشابه
ar X iv : 1 40 1 . 82 09 v 2 [ cs . L O ] 2 M ay 2 01 4 Propositional Logics Complexity and the Sub - Formula Property Edward
In 1979 Richard Statman proved, using proof-theory, that the purely implicational fragment of Intuitionistic Logic (M→) is PSPACEcomplete. He showed a polynomially bounded translation from full Intuitionistic Propositional Logic into its implicational fragment. By the PSPACE-completeness of S4, proved by Ladner, and the Gödel translation from S4 into Intuitionistic Logic, the PSPACE-completenes...
متن کاملPropositional Logics Complexity and the Sub-Formula Property
In 1979 Richard Statman proved, using proof-theory, that the purely implicational fragment of Intuitionistic Logic (M→) is PSPACE-complete. He showed a polynomialy bounded translation from full Intuitionistic Propositional Logic into its implicational fragment. By the PSPACEcompleteness of S4, proved by Ladner, and the Gödel translation from S4 into Intuitionistic Logic, the PSPACE-completeness...
متن کاملImplicational F-Structures and Implicational Relevance Logics
We describe a method for obtaining classical logic from intuitionistic logic which does not depend on any proof system, and show that by applying it to the most important implicational relevance logics we get relevance logics with nice semantical and proof-theoretical properties. Semantically all these logics are sound and strongly complete relative to classes of structures in which all element...
متن کاملIntuitionistic implication makes model checking hard
We investigate the complexity of the model checking problem for intuitionistic and modal propositional logics over transitive Kripke models. More specific, we consider intuitionistic logic IPC, basic propositional logic BPL, formal propositional logic FPL, and Jankov’s logic KC. We show that the model checking problem is P-complete for the implicational fragments of all these intuitionistic log...
متن کاملAn Abstract Approach to Fuzzy Logics: implicational semilinear logics
This paper presents a new abstract framework to deal in a uniform way with the increasing variety of fuzzy logics studied in the literature. By means of notions and techniques from Abstract Algebraic Logic, we perform a study of non-classical logics based on the kind of generalized implication connectives they possess. It yields the new hierarchy of implicational logics. In this framework the n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 81 شماره
صفحات -
تاریخ انتشار 2014